Solving large scale crew scheduling problems in practice
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملSolving Large Scale Crew Pairing Problems
Crew pairing is one of the most critical processes in airline management operations. Taking a timetable as input, the objective of this process is to find an optimal way to partition flights of the timetable without breaking rules and regulations which are enforced by an airline. The problem has attracted many scientists in recent decades. The main challenge is that there is no general method t...
متن کاملSolving Vehicle and Crew Scheduling Problems Simultaneously
In the integrated vehicle and crew scheduling problem (VCSP) one has to simultaneously assign vehicles to timetabled trips and drivers to vehicles. In this paper two integer linear programming formulations are used to describe the integrated problem. On both formulations the multi-depot vehicle scheduling problem is modeled as a multicommodity flow problem while the crew scheduling problem is m...
متن کاملAn Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems
Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Public Transport
سال: 2011
ISSN: 1866-749X,1613-7159
DOI: 10.1007/s12469-011-0045-x